منابع مشابه
Constrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملLeast squares cubic splines without B-splines
There are thousands of articles published on variants of splines, including least squares cubic splines. One of the first least squares articles was de Boor and Rice [1], and a comprehensive explanatory textbook is Dierckx [2]. Unfortunately, every example in the literature and on the web of a least squares cubic spline makes use of B-splines. While B-splines have a certain elegance, they are s...
متن کاملSmoothing with Cubic Splines
A spline function is a curve constructed from polynomial segments that are subject to conditions or continuity at their joints. In this paper, we shall present the algorithm of the cubic smoothing spline and we shall justify its use in estimating trends in time series. Considerable effort has been devoted over several decades to developing the mathematics of spline functions. Much of the intere...
متن کاملReliability Estimation Based on Cubic Splines
software quality attribute and Software reliability estimation is a hard problem to solve accurately. However for management of software quality and standard practice of the organization, accurate reliability estimation is important. Non-homogeneous Poisson Process (NHPP) models and Artificial Neural Network (ANN) models are among the most important software reliability growth models. In this p...
متن کاملInterpolation by Cubic Splines on Triangulations
We describe an algorithm for constructing point sets which admit unique Lagrange and Hermite interpolation from the space S 1 3 (() of C 1 splines of degree 3 deened on a general class of triangulations. The triangulations consist of nested polygons whose vertices are connected by line segments. In particular, we have to determine the dimension of S 1 3 (() which is not known for arbitrary tria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1968
ISSN: 0021-9045
DOI: 10.1016/0021-9045(68)90053-1